Regular Expression Containment with xs:all-like Operators
نویسنده
چکیده
We discuss containment checking for regular expressions with operators like XML Schema’s xs:all, that is, the operator that allows a sequence of letters to occur in arbitrary order. In this report, we model this operator by &, and give several algorithms of containment checking for regular expressions with &. Our algorithms are based on the notion of the permutability of word languages. Keyword: XML Schema, Language Containment, ZBDD
منابع مشابه
Symbolic Solving of Extended Regular Expression Inequalities Technical Report
This paper presents a new solution to the containment problem for extended regular expressions that extends basic regular expressions with intersection and complement operators and consider regular expressions on infinite alphabets based on potentially infinite character sets. Standard approaches deciding the containment do not take extended operators or character sets into account. The algorit...
متن کاملSymbolic Solving of Extended Regular Expression Inequalities
This paper presents a new algorithm for the containment problem for extended regular expressions that contain intersection and complement operators and that range over infinite alphabets. The algorithm solves extended regular expressions inequalities symbolically by term rewriting and thus avoids the translation to an expression-equivalent automaton. Our algorithm is based on Brzozowski’s regul...
متن کاملContainment of Nested Regular Expressions
Nested regular expressions (NREs) have been proposed as a powerful formalism for querying RDFS graphs, but research in a more general graph database context has been scarce, and static analysis results are currently lacking. In this paper we investigate the problem of containment of NREs, and show that it can be solved in PSPACE, i.e., the same complexity as the problem of containment of regula...
متن کاملQuery Answering and Containment for Regular Path Queries under Distortions
We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the query languages for semistructured databases. To enable approximations, we allow the regular path queries to be distorted. The distortions are expressed in the system by using weighted regular expressions, which correspond to weig...
متن کاملContainment of Conjunctive Regular Path Queries with Inverse
Reasoning on queries is a basic problem both in knowledge representation and databases. A fundamental form of reasoning on queries is checking containment, i.e., verifying whether one query yields necessarily a subset of the result of another query. Query containment is crucial in several contexts, such as query optimization, knowledge base verification, information integration, database integr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005